Ising Machines—Quantum-Inspired Machines for Combinatorial Optimization—
نویسندگان
چکیده
本稿では,近年国内外で活発に研究開発されているイジングマシンについて述べる.イジングマシンとは,イジング問題と呼ばれる組合せ最適化問題に特化した専用計算機である.世界初の商用量子コンピュータである量子アニーラがイジングマシンの一種であり,それをGoogleとNASAが創設した量子人工知能研究所が購入したことをきっかけに,イジングマシンが注目を集めるようになった.現在では,超伝導や光といった特殊なハードウェアだけでなく,従来の半導体デジタル計算機を利用して実用性を高めたものも多く,ドメイン指向コンピューティングの新たな潮流となっている.後者は主にアルゴリズムに特徴があり,中には量子計算にインスパイアされて発見されたものもある.そもそも量子アニーラに端を発した研究という経緯もあり,メディアはこれらを「疑似量子コンピュータ」と呼ぶことがある.イジングマシンと似たものとして,ホップフィールドニューラルネットワークをご存じの読者は多いだろう.実際,ホップフィールドニューラルネットワークの派生物であるボルツマンマシンなどは,現在のイジングマシンとの関係が深い.そこで,本稿の前半では,特殊ハードウェアから疑似量子コンピュータまで,現在開発中の多種多様なイジングマシンをホップフィールドニューラルネットワークやその派生物との類似に触れながら紹介する.後半は,筆者が提案し,現在も研究開発中である疑似量子コンピュータ,シミュレーテッド分岐マシンについて解説する.
منابع مشابه
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the popul...
متن کاملAdvances in Bio-inspired Computing for Combinatorial Optimization Problems
Preparing the books to read every day is enjoyable for many people. However, there are still many people who also don't like reading. This is a problem. But, when you can support others to start reading, it will be better. One of the books that can be recommended for new readers is advances in bio inspired computing for combinatorial optimization problems. This book is not kind of difficult boo...
متن کاملAdaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems
The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency. This is particularly useful for NP-hard problems such as graph layout problems. Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper foc...
متن کاملParallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem
This paper proposes a new parallel evolutionary algorithm called parallel quantum-inspired genetic algorithm (PQGA). Quantum-inspired genetic algorithm(QGA) is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation, QGA can represent a linear sup...
متن کاملScalability of using Restricted Boltzmann Machines for Combinatorial Optimization
Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Restricted Boltzmann Machines (RBMs) are generative neural networks with these desired properties. We integrate an RBM into an EDA and evaluate the performance of this system in solving combinatorial optimization problems with a single objective. We assess how the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Brain & Neural Networks
سال: 2022
ISSN: ['1340-766X', '1883-0455']
DOI: https://doi.org/10.3902/jnns.29.174